Centroidal bases in graphs
نویسندگان
چکیده
منابع مشابه
Centroidal bases in graphs
We introduce the notion of a centroidal locating set of a graph G, that is, a set L of vertices such that all vertices in G are uniquely determined by their relative distances to the vertices of L. A centroidal locating set of G of minimum size is called a centroidal basis, and its size is the centroidal dimension CD(G). This notion, which is related to previous concepts, gives a new way of ide...
متن کاملCentroidal Voronoi Tesselation of Line Segments and Graphs
Centroidal Voronoi Tesselation (CVT) of points has many applications in geometry processing, including re-meshing and segmentation to name but a few. In this paper, we propose a new extension of CVT, generalized to graphs. Given a graph and a 3D polygonal surface, our method optimizes the placement of the vertices of the graph in such a way that the graph segments best approximate the shape of ...
متن کاملCentroidal Voronoi Tessellation of Line Segments and Graphs
Centroidal Voronoi Tessellation (CVT) of points has many applications in geometry processing, including remeshing and segmentation, to name but a few. In this paper, we generalize the CVT concept to graphs via a variational characterization. Given a graph and a 3D polygonal surface, our method optimizes the placement of the vertices of the graph in such a way that the graph segments best approx...
متن کاملIdeals and graphs, Gröbner bases and decision procedures in graphs
The well known correspondence between even cycles of an undirected graph and polynomials in a binomial ideal associated to a graph is extended to odd cycles and polynomials in another binomial ideal. Other binomial ideals associated to an undirected graph are also introduced. The results about them with topics on monomial ideals are used in order to show decision procedures for bipartite graphs...
متن کاملOn Additive Bases and Harmonious Graphs
This paper first considers several types of additive bases. A typical problem is to find nv(k), the largest n for which there exists a set {0 al < a2 <" < ak} Of distinct integers modulo n such that each in the range 0 =<-< n can be written at least once as mai + aj (modulo n) with </'. For example, nv(8) 24, The other problems arise if at least is changed to at most, or </' to-</', or if the w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2014
ISSN: 0028-3045
DOI: 10.1002/net.21560